ö[ ELEMENTARY PROOF OF THE WI ELAN DT-HOFFMAN THEOREM « AND OF ITS GENERALIZATION BY
نویسنده
چکیده
An elementary proof is given of the Wielandt-Hofftnan Theorem for normal matrices and of a generalization of this theorem. The proof makes no direct appeal to results fron linearprogramming theory. Reproduction in whole or in part is permitted for any purpose of the United States Government, Division of Numerical and Applied Mathematics) National Physical Laboratory, Teddington, Middlesex, England and Computer Science Department,, Stanford University. At Stanford the preparation of the paper was sponsored by the Office of Naval Research and the National Science Foundation.
منابع مشابه
On the norm of the derived subgroups of all subgroups of a finite group
In this paper, we give a complete proof of Theorem 4.1(ii) and a new elementary proof of Theorem 4.1(i) in [Li and Shen, On the intersection of the normalizers of the derived subgroups of all subgroups of a finite group, J. Algebra, 323 (2010) 1349--1357]. In addition, we also give a generalization of Baer's Theorem.
متن کاملThe Basic Theorem and its Consequences
Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...
متن کاملGeneralization of Darbo's fixed point theorem and application
In this paper, an attempt is made to present an extension of Darbo's theorem, and its applicationto study the solvability of a functional integral equation of Volterra type.
متن کاملOrder -
Generalization, also called anti-unification, is the dual of unification. Given terms t and t′, a generalization is a term t′′ of which t and t′ are substitution instances. The dual of a most general unifier (mgu) is that of least general generalization (lgg). In this work, we extend the known untyped generalization algorithm to an order-sorted typed setting with sorts, subsorts, and subtype po...
متن کاملOrder-Sorted Generalization
Generalization, also called anti-unification, is the dual of unification. Given terms t and t′, a generalization is a term t′′ of which t and t′ are substitution instances. The dual of a most general unifier (mgu) is that of least general generalization (lgg). In this work, we extend the known untyped generalization algorithm to an order-sorted typed setting with sorts, subsorts, and subtype po...
متن کامل